全文获取类型
收费全文 | 218篇 |
免费 | 87篇 |
国内免费 | 19篇 |
出版年
2022年 | 1篇 |
2021年 | 6篇 |
2020年 | 4篇 |
2019年 | 6篇 |
2018年 | 1篇 |
2017年 | 13篇 |
2016年 | 18篇 |
2015年 | 18篇 |
2014年 | 24篇 |
2013年 | 49篇 |
2012年 | 11篇 |
2011年 | 13篇 |
2010年 | 10篇 |
2009年 | 5篇 |
2008年 | 5篇 |
2007年 | 7篇 |
2006年 | 13篇 |
2005年 | 18篇 |
2004年 | 14篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 7篇 |
2000年 | 10篇 |
1999年 | 20篇 |
1998年 | 6篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 5篇 |
1992年 | 7篇 |
1991年 | 3篇 |
1990年 | 2篇 |
排序方式: 共有324条查询结果,搜索用时 500 毫秒
31.
Pirja Heiskanen 《海军后勤学研究》2001,48(3):210-225
In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001 相似文献
32.
后方油库整体生存概率分析计算 总被引:1,自引:1,他引:0
针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。 相似文献
33.
Fangruo Chen 《海军后勤学研究》2000,47(5):422-439
Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000 相似文献
34.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000 相似文献
35.
36.
一种模糊自适应INS/GPS组合导航方法 总被引:6,自引:0,他引:6
提出了一种基于模糊逻辑的自适应卡尔曼滤波新算法,即基于滤波数据残差构造一种模糊算法,以自适应控制卡尔曼滤波器的增益系数。从而可以消除异常的测量数据带来的影响,使滤波器的残差始终保持零均值,且使估计误差的协方差阵收敛,最终实现最优估计。通过对INS/GPS组合导航系统的计算机仿真结果表明,该算法具有比常规卡尔曼滤波算法更高的导航精度。 相似文献
37.
对几种预警探测方式问题研究 总被引:1,自引:0,他引:1
随着高科技武器装备在战争中的使用,预警探测问题也越来越重要,如何更好地运用预警探测装备已经成为预警探测能力的“瓶颈”。结合实际,对几种装备的预警探测问题进行了分析,研究了舰载直升机、雷达哨舰及侦察机等预警探测设备的战术运用,最后给出了这几种预警探测装备的合理战术运用方法。 相似文献
38.
基于不确定性理论的研制技术风险评估方法研究 总被引:2,自引:0,他引:2
分析了装备研制技术风险的含义,根据技术风险的特点建立了评价技术风险的指标体系。在技术风险度量中引入不确定性理论的概念,并建立了基于不确定性的技术风险的度量方法,对综合技术风险进行评价。最后通过实例验证了综合评价方法的可用性。 相似文献
39.
陆军诸兵种合同作战兰切斯特方程的弹药消耗预测研究 总被引:2,自引:0,他引:2
描述了诸兵种合同作战的兰切斯特方程及其矩阵解,提出了一种通过兵力损耗换算弹药损耗的新思路,分析和确定了用该方法预测弹药消耗的相关参数,最后运用Matlab进行仿真计算,预测出了武器装备战损情况和弹药消耗情况。 相似文献
40.